Errata—Correction to “Optimal Control of an M/M/S Queueing System”
نویسندگان
چکیده
منابع مشابه
Optimal Control of a Two-Server Queueing System with Failures
We consider the problem of controlling a two-server Markovian queueing system with heterogeneous servers. The servers are differentiated by their service rates and reliability attributes (i.e., the slower server is perfectly reliable while the faster server is subject to random failures). The aim is to dynamically route customers at arrival, service completion, server failure, and server repair...
متن کاملOptimal Control of a Queueing System with Three Heterogeneous Servers
We study the problem of optimally controlling a three server queueing system. Arriving customers join a single queue, which is served by three servers, 8 1 , 52 and 53. The servers are exponential, but of different rates. The total expected time a customer spends in the system is to be minimized. We show that the optimal policy can be characterized by three thresholds, m3,mb and mi, such that: ...
متن کاملAn optimal control problem for a engineering system
In this article, we apply this new method for solving an engineering systemwith initial and boundary conditions and integral criterion ,and we will usingdynamic programming as iteration for solving model.
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولThe Complexity of Optimal Queueing Network Control
[6,11] by reducing them to extensions of the multi-We consider the classical problem of optimal control armed bandit problem, the problem of repeatedly se-(routing and sequencing) of a network of queues. We lecting one among many Markov processes, each with prove that this problem is EXP-complete and, there-known transition probabilities and costs. The latter fore, provably intractable. Similar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1986
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.34.1.184a